Vectorization hierarchies of some graph quantifiers
نویسندگان
چکیده
We give a suucient condition for the inexpressibility of the k-th extended vector-ization of a generalized quantiier Q in FO(Q k), the extension of rst-order logic by all k-ary quantiiers. The condition is based on a model construction which, given two FO(Q 1)-equivalent models with certain additional structure, yields a pair of FO(Q k)-equivalent models. We also consider some applications of this condition to quantiiers that correspond to graph properties, such as connectivity and planarity.
منابع مشابه
Hierarchies of monadic generalized quanti
A combinatorial criterium is given when a monadic quantiier is expressible by means of universe-independent monadic quantiiers of width n. It is proved that the corresponding hierarchy does not collapse. As an application, it is shown that the second resumption (or vectorization) of the HH artig quantiier is not deenable by monadic quantiiers. The techniques rely on Ramsey theory.
متن کاملHierarchies in Inclusion Logic with Lax Semantics
We study the expressive power of fragments of inclusion logic under the so-called lax team semantics. The fragments are defined either by restricting the number of universal quantifiers or the arity of inclusion atoms in formulae. In case of universal quantifiers, the corresponding hierarchy collapses at the first level. Arity hierarchy is shown to be strict by relating the question to the stud...
متن کاملSuccinct Inputs, Lindström Quantifiers, and a General Complexity Theoretic Operator Concept
We address the question of the power of several logics with Lindström quantifiers over finite ordered structures. We will see that in the first-order case this nicely fits into the framework of Barrington, Immerman, and Straubing’s examination of constant depth circuit classes. In the second-order case we get a strong relationship to succinct encodings of languages via circuits. Some of these l...
متن کاملRank Hierarchies for Generalized Quantifiers
We show that for each n and m, there is an existential first order sentence which is NOT logically equivalent to a sentence of quantifier rank at most m in infinitary logic augmented with all generalized quantifiers of arity at most n. We use this to show the strictness of the quantifier rank hierarchies for various logics ranging from existential (or universal) fragments of first order logic t...
متن کاملFurther Results for Improving Loop Interchange in Non-Adjacent and Imperfectly Nested Loops
Abstract Loop interchange is a powerful restructuring technique for supporting vectorization and parallelization. In this paper, we propose a technique which is better to determine whether loops can be interchanged between two non-adjacent loops. We also present a method for determining whether we can directly make loop interchange on an imperfectly nested loop. Some experimental results are al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Arch. Math. Log.
دوره 39 شماره
صفحات -
تاریخ انتشار 2000